furthermore, we show when a matrix is column-divided and how to divide a matrix which is column-divided based on the classic qr factorization . numerical examples are also given to show that the divide-and-conquer method is efficient 在此基础上,我们进一步给出了判断一个矩阵是列可分的可分准则,此可分准则利用数值代数中常用的qr分解得到。
a integrated algorithm of ambiguity resolution is proposed . by using triple carrier phase, integer gauss transformations, qr factorization, cholesky factorization, and geometry constraint, the correlation between ambiguity components is reduced, and more error ambiguity can be discarded, also process of ambiguity searching getting rapidly . the ratio test combining constraint of baseline is used to fix ambiguity rapidly 利用三差最小二乘求解模糊度浮点解,然后采用整数高斯变换降低模糊度分量间的相关性,再根据qr分解和基线几何约束减少需搜索的模糊度组合,采用cholesky分解在搜索过程中及早淘汰不正确的模糊度组合,最后利用ratio检验与基线几何约束条件相结合检验模糊度组合,尽快固定正确的模糊度。